Asymptotically Optimal Quantum Circuits ford-Level Systems
نویسندگان
چکیده
منابع مشابه
Asymptotically optimal quantum circuits for d-level systems.
Scalability of a quantum computation requires that the information be processed on multiple subsystems. However, it is unclear how the complexity of a quantum algorithm, quantified by the number of entangling gates, depends on the subsystem size. We examine the quantum circuit complexity for exactly universal computation on many d-level systems (qudits). Both a lower bound and a constructive up...
متن کاملAsymptotically Optimal Topological Quantum Compiling
We address the problem of compiling quantum operations into braid representations for non-Abelian quasiparticles described by the Fibonacci anyon model. We classify the single-qubit unitaries that can be represented exactly by Fibonacci anyon braids and use the classification to develop a probabilistically polynomial algorithm that approximates any given single-qubit unitary to a desired precis...
متن کاملAsymptotically optimal perfect steganographic systems
In 1998 C. Cachin proposed an information-theoretic approach to steganography. In particular, in the framework of this approach the so-called perfectly secure stegosystem was defined, where messages that carry and do not carry hidden information are statistically indistinguishable. There was also described a universal steganographic system, for which this property holds only asymptotically, as ...
متن کاملAsymptotically Optimal Discrimination between Pure Quantum States
We consider the decision problem between a finite number of states of a finite quantum system, when an arbitrarily large number of copies of the system is available for measurements. We provide an upper bound on the exponential rate of decay of the averaged probability of rejecting the true state. It represents a generalized quantum Chernoff distance of a finite set of states. As our main resul...
متن کاملSynthesis and Complexity of Asymptotically Optimal Circuits with Unreliable Gates
We consider the realization of Boolean functions by combinatorial circuits with unreliable gates computing the functions from a full final basis B. We assume that all gates of the basis can have inverse faults on the outputs independently with probability ε (ε ∈ (0, 1/2)). We describe a set Mk (k ≥ 3) of Boolean functions, presence even by one of which in basis B guarantees the computing of alm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2005
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.94.230502